package LeetCode;

import java.util.Arrays;

/**
 * @Classname LC213
 * @Description // https://leetcode-cn.com/problems/house-robber-ii/submissions/ 动态规划 打家劫舍2
 * @Date 2021/4/20 1:31
 * @Created by yin
 */
public class LC213 {
    public int rob(int[] nums) {
        if (nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];
        if (nums.length == 2) return Math.max(nums[1], nums[0]);
        int a = subrob(Arrays.copyOfRange(nums, 0, nums.length - 1));
        int b = subrob(Arrays.copyOfRange(nums, 1, nums.length));
        return Math.max(a, b);
    }

    public int subrob(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
        }
        return dp[nums.length - 1];
    }
}
